No Fees to Enroll Them All?

No One SATPlan Encoding To Rule Them All

Solving planning problems via translation to propositional satisfiability (SAT) is one of the most successful approaches to automated planning. An important aspect of this approach is the encoding, i.e., the construction of a propositional formula from a given planning problem instance. Numerous encoding schemes have been proposed in the recent years each aiming to outperform the previous encod...

No user fees, but perhaps user fees.

One to rule them all

The development of transposon-based genome manipulation tools can benefit greatly from understanding transposons' inherent regulatory mechanisms. The Tc1-mariner transposons, which are being widely used in biotechnological applications, are subject to a self-inhibitory mechanism whereby increasing transposase expression beyond a certain point decreases the rate of transposition. In a recent pap...

One entropy function to rule them all

We study the entropy of extremal four dimensional black holes and five dimensional black holes and black rings is a unified framework using Sen’s entropy function and dimensional reduction. The five dimensional black holes and black rings we consider project down to either static or stationary black holes in four dimensions. The analysis is done in the context of two derivative gravity coupled ...

GILBO: One Metric to Measure Them All

We propose a simple, tractable lower bound on the mutual information contained in the joint generative density of any latent variable generative model: the GILBO (Generative Information Lower BOund). It offers a data independent measure of the complexity of the learned latent variable description, giving the log of the effective description length. It is well-defined for both VAEs and GANs. We ...